Programming Research Group APPROXIMATING SIMULATIONS
نویسنده
چکیده
Simulation rules provide a simple, sound and complete technique for proving that one data type reenes another. This paper expresses the dependence of the sound-ness and completeness on the programming language by showing how sound and complete simulation rules for a given language are derived from those for its sublanguages. The dependence of the completeness on the semantic model is expressed using a JJ onsson/Tarski duality translation between the relational and predicate transformer semantics of data types and simulation rules. Both these dependencies are considered in the context of a simple language for terminating programs.
منابع مشابه
A New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming
This paper describes a new optimization method for solving continuous semi-infinite linear problems. With regard to the dual properties, the problem is presented as a measure theoretical optimization problem, in which the existence of the solution is guaranteed. Then, on the basis of the atomic measure properties, a computation method was presented for obtaining the near optimal so...
متن کاملDimensionality Reduction and Improving the Performance of Automatic Modulation Classification using Genetic Programming (RESEARCH NOTE)
This paper shows how we can make advantage of using genetic programming in selection of suitable features for automatic modulation recognition. Automatic modulation recognition is one of the essential components of modern receivers. In this regard, selection of suitable features may significantly affect the performance of the process. Simulations were conducted with 5db and 10db SNRs. Test and ...
متن کاملInference for the Type-II Generalized Logistic Distribution with Progressive Hybrid Censoring
This article presents the analysis of the Type-II hybrid progressively censored data when the lifetime distributions of the items follow Type-II generalized logistic distribution. Maximum likelihood estimators (MLEs) are investigated for estimating the location and scale parameters. It is observed that the MLEs can not be obtained in explicit forms. We provide the approximate maximum likelihood...
متن کاملDistributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximation algorithm by applying linear programming approximation techniques. Our algorithm is an application of the Garg-Könemann (GK) scheme that requires solving an instance of the minimum weight dominating set (MWDS) prob...
متن کاملClosed-Form Analytical Equations to Transient Analysis of Bang-Bang Phase-Locked Loops
Due to the nonlinear nature of the Bang-Bang phase-locked loops (BBPLLs), its transient analysis is very difficult. In this paper, new equations are proposed for expression of transient behavior of the second order BBPLLs to phase step input. This approach gives new insights into the transient behavior of BBPLLs. Approximating transient response to reasonable specific waveform the loop tran...
متن کامل